MPSAGA: a matrix-based pair-wise sequence alignment algorithm for global alignment with position based sequence representation
نویسندگان
چکیده
منابع مشابه
A comparison of four pair-wise sequence alignment methods
Protein sequence alignment has become an essential task in modern molecular biology research. A number of alignment techniques have been documented in literature and their corresponding tools are made available as freeware and commercial software. The choice and use of these tools for sequence alignment through the complete interpretation of alignment results is often considered non-trivial by ...
متن کاملContact-based sequence alignment.
This paper introduces the novel method of contact-based protein sequence alignment, where structural information in the form of contact mutation probabilities is incorporated into an alignment routine using contact-mutation matrices (CAO: Contact Accepted mutatiOn). The contact-based alignment routine optimizes the score of matched contacts, which involves four (two per contact) instead of two ...
متن کاملA Fast Template Based Heuristic For Global Multiple Sequence Alignment
Advances in bio-technology have made available massive amounts of functional, structural and genomic data for many biological sequences. This increased availability of heterogeneous biological data has resulted in biological applications where a multiple sequence alignment (msa) is required for aligning similar features, where a feature is described in structural, functional or evolutionary ter...
متن کاملFOGSAA: Fast Optimal Global Sequence Alignment Algorithm
In this article we propose a Fast Optimal Global Sequence Alignment Algorithm, FOGSAA, which aligns a pair of nucleotide/protein sequences faster than any optimal global alignment method including the widely used Needleman-Wunsch (NW) algorithm. FOGSAA is applicable for all types of sequences, with any scoring scheme, and with or without affine gap penalty. Compared to NW, FOGSAA achieves a tim...
متن کاملA Sort-based Algorithm for Multiple Sequence Alignment *
We propose a sort-based algorithm for multiple sequence alignment using anchors. Anchors are determined by the use of suffix sorting along with position-based sorts. Potential anchor points are identified by a careful exploitation of the sorted suffixes obtained from a generalized suffix array of the input sequences. Final alignment is obtained by a recursive application of the suffix-sorting a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sādhanā
سال: 2019
ISSN: 0256-2499,0973-7677
DOI: 10.1007/s12046-019-1141-x